Computing welfare-Maximizing fair allocations of indivisible goods
نویسندگان
چکیده
We analyze the run-time complexity of computing allocations that are both fair and maximize utilitarian social welfare, defined as sum agents’ utilities. focus on two tractable fairness concepts: envy-freeness up to one item (EF1) proportionality (PROP1). consider computational problems: (1) Among utilitarian-maximal allocations, decide whether there exists is also fair; (2) among compute maximizes welfare. show problems strongly NP-hard when number agents variable, remain for a fixed greater than two. For special case agents, we find problem polynomial-time solvable, while remains NP-hard. Finally, with design pseudopolynomial-time algorithms problems. extend our results stronger notions any (EFx) (PROPx).
منابع مشابه
On regular and approximately fair allocations of indivisible goods
An active stream of research is devoted to the design of polynomial approximation algorithms for the fair allocation of indivisible goods. Central to this field is the MaxMin Allocation problem, for which there is a significant gap between known approximation and inapproximability results. Closing this gap is a stimulating challenge. To this end, we consider a regular version of MaxMin Allocati...
متن کاملFair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (rather than utility functions) and when our knowledge of those preferences is incomplete. The incompleteness of the preferences stems from the fact that each agent reports their preferences by means of an expression of...
متن کاملApproximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods
Max-min fair allocations and proportionally fair allocations are desirable outcomes in a fair division of indivisible goods. Unfortunately, such allocations do not always exist, not even in very simple settings with few agents. A natural question is to ask about the largest value c for which there is an allocation such that every agent has utility of at least c times her fair share. Our goal is...
متن کاملFair Allocation of Indivisible Goods
As introduced in Chapter 11 (Thomson, 2015), Fair Division refers to the general problem of fairly dividing a common resource among agents having different —and sometimes antagonistic— interests in the resource. But under this general term one can actually gather a cluster of very different problems, all calling for different solution concepts: after all, one can easily figure out that we canno...
متن کاملFair Allocation of Indivisible Public Goods
We consider the problem of fairly allocating indivisible public goods. We model the public goods as elements with feasibility constraints on what subsets of elements can be chosen, and assume that agents have additive utilities across elements. Our model generalizes existing frameworks such as fair public decision making and participatory budgeting. We study a groupwise fairness notion called t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2023
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2022.10.013